package Lee_code;

public class Lee_309 {
    public int maxProfit(int[] prices) {
        int len = prices.length;

        //dp[i][0]是有股票, dp[i][1]是没有股票, 冷冻期是一天
        int[][] dp = new int[len][2];

        dp[0][0] = -prices[0];
        dp[0][1] = 0;
        dp[1][0] = Math.max(-prices[0], -prices[1]);
        dp[1][1] = Math.max(dp[0][1], dp[0][0] + prices[1]);

        for(int i = 2; i < len; i++){
            dp[i][0] = Math.max(dp[i-1][0], dp[i-2][1] - prices[i]);
            dp[i][1] = Math.max(dp[i-1][1], dp[i-1][0] + prices[i]);
        }

        return dp[len-1][1];
    }
}
